package leetcode.D1000.T931;

import util.GraphUtil;

/**
 * @File Info: leetcode -- <M931>
 * @Author: 18362
 * @Create: 2022-02-20 20:58:43 星期日
 */
public class M931 {
    public static void main(String[] args) {
        int[][] matrix = GraphUtil.parseGraph("[[2,1,3],[6,5,4],[7,8,9]]");
        System.out.println(new Solution().minFallingPathSum(matrix));
    }
}
